Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

游客情感计算的文本大数据挖掘方法比较研究

旅游文本大数据以其方便、快捷和低门槛的特点为游客情感计算提供了极大便利，已经成为旅游大数据的主要来源之一。基于大数据理论和情感理论，以文本大数据为数据源，在全面梳理国内外情感计算相关成果的基础上，利用人工智能中的逻辑/算法编程方法、机器学习方法、深度学习方法对旅游文本大数据进行挖掘，探索最佳的基于文本大数据的游客情感计算方法。研究发现：（1）基于情感词典的游客情感计算模型，其核心是构建情感词典和设计情感计算规则，方法简单，容易实现，适用语料范围广。（2）机器学习，用统计学方法抽取文本中的特征项，具有非线性特征，可靠性较线性特征的情感词典方法高。（3）基于深度学习技术的游客情感计算，效果良好，准确率在85%以上。训练多领域的文本语料易于移植，实用性强，且泛化能力好，较适合大数据时代游客情感计算研究。     

A posteriori error analysis of a quadratic finite volume method for nonlinear elliptic problems

In this article, we construct and analyze a residual-based a posteriori error estimator for a quadratic finite volume method (FVM) for solving nonlinear elliptic partial differential equations with homogeneous Dirichlet boundary conditions. We shall prove that the a posteriori error estimator yields the global upper and local lower bounds for the norm error of the FVM. So that the a posteriori error estimator is equivalent to the true error in a certain sense. Numerical experiments are performed to illustrate the theoretical results.     

Molecular design of ambipolar redox-active molecules II: closed-shell systems

This mini-review highlights key structural features that should be taken into account when creating ambipolar redox-active closed-shell metal-free molecules. This type of compound is strongly required for the fabrication of all-organic ‘poleless’ batteries and semiconductors. The suggested strategies aimed at stabilization of both oxidized (cationic) and reduced (anionic) redox-states are based on the comprehensive analysis of the most successful structures taken from the recent publications.     

Setting local rank constraints by orthogonal projections for image resolution analysis: Application to the determination of a low dose pharmaceutical compound

Raman chemical imaging provides chemical and spatial information about pharmaceutical drug product. By using resolution methods on acquired spectra, the objective is to calculate pure spectra and distribution maps of image compounds. With multivariate curve resolution-alternating least squares, constraints are used to improve the performance of the resolution and to decrease the ambiguity linked to the final solution. Non negativity and spatial local rank constraints have been identified as the most powerful constraints to be used.     

煤直接液化油中混合酚的分离研究

利用分子筛择形特点，对煤直接液化油中的混合酚实施高效分离。本研究选取间甲酚和对甲酚作为分离煤直接液化油馏分段混合酚的模型化合物，采用化学液相沉积法对HZSM-5吸附剂的孔口结构进行改变，分析分子筛硅铝比及颗粒粒径对模型化合物间甲酚和对甲酚吸附分离性能的影响，以获得高性能固相吸附剂，并将其应用于180-190℃馏分段混合酚分离。结果表明，当分子筛硅铝比为25、粒径为3-5 μm时，分子筛的孔口结构调节效果最优；当正硅酸乙酯的最小用量为0.2 mL/g时，固相吸附剂的吸附量为0.03 g/g，对甲酚选择性高于95%。由于外表面沉积物对吸附剂的孔口结构变化，导致对甲酚选择性的提高。进一步采用HZSM-5（1）吸附剂对真实煤直接液化油混合酚的分离中发现，苯酚和对甲酚的选择性均达到100%。     

A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.